Games and Full Abstraction for FPC
نویسندگان
چکیده
منابع مشابه
Games and Full Abstraction for FPC
A new category of games is developed which improves over existing such categories in that it interprets sums as well as products, function spaces and recursive types. A model of FPC, a sequential functional language with just this type structure, is described and shown to be fully abstract.
متن کاملGames and definability for FPC
A new games model of the language FPC, a type theory with products, sums, function spaces and recursive types, is described. A definability result is proved, showing that every finite element of the model is the interpretation of some term of the language. §
متن کاملGames and Full Abstraction for Pcf: Preliminary Announcement Intensional Full Abstraction
is one of the longest-standing problems in the semantics of programming languages. There is quite widespread agreement that it is one of the most diicult; there is much less agreement as to what exactly the problem is, or more particularly as to the precise criteria for a solution. The usual formulation is that one wants a \semantic characterization" of the fully abstract model (by which we mea...
متن کاملGames and Full Abstraction for the Lazy -calculus
We deene a category of games G, and its extensional quotient E. A model of the lazy-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the rst purely semantic construction of a fully abstract model fo...
متن کاملObservable Sequentiality and Full Abstraction 1 Full Abstraction and Sequentiality
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2845